on rainbow 4-term arithmetic progressions
Authors
abstract
{sl let $[n]={1,dots, n}$ be colored in $k$ colors. a rainbow ap$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. conlon, jungi'{c} and radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow ap(4) free, when $n$ is even. based on their construction, we show that such a coloring of $[4n]$ also exists for odd $n>1$. we conclude that for nonnegative integers $kgeq 3$ and $n > 1$, every equinumerous $k$-coloring of $[kn]$ contains a rainbow ap$(k)$ if and only if $k=3$.}
similar resources
On rainbow 4-term arithmetic progressions
{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...
full textRainbow 3-term Arithmetic Progressions
Consider a coloring of {1, 2, . . . , n} in 3 colors, where n ≡ 0 (mod 3). If all the color classes have the same cardinality, then there is a 3-term arithmetic progression whose elements are colored in distinct colors. This rainbow variant of van der Waerden’s theorem proves the conjecture of the second author.
full textOn Rainbow Arithmetic Progressions
Consider natural numbers {1, · · · , n} colored in three colors. We prove that if each color appears on at least (n + 4)/6 numbers then there is a three-term arithmetic progression whose elements are colored in distinct colors. This variation on the theme of Van der Waerden’s theorem proves the conjecture of Jungić et al.
full textRainbow Arithmetic Progressions
In this paper, we investigate the anti-Ramsey (more precisely, anti-van der Waerden) properties of arithmetic progressions. For positive integers n and k, the expression aw([n], k) denotes the smallest number of colors with which the integers {1, . . . , n} can be colored and still guarantee there is a rainbow arithmetic progression of length k. We establish that aw([n], 3) = Θ(log n) and aw([n...
full textRainbow Arithmetic Progressions in Finite Abelian Groups
For positive integers n and k, the anti-van der Waerden number of Zn, denoted by aw(Zn, k), is the minimum number of colors needed to color the elements of the cyclic group of order n and guarantee there is a rainbow arithmetic progression of length k. Butler et al. showed a reduction formula for aw(Zn, 3) = 3 in terms of the prime divisors of n. In this paper, we analagously define the anti-va...
full textRainbow Arithmetic Progressions and Anti-Ramsey Results
The van der Waerden theorem in Ramsey theory states that, for every k and t and sufficiently large N, every k-colouring of [N] contains a monochromatic arithmetic progression of length t. Motivated by this result, Radoičić conjectured that every equinumerous 3-colouring of [3n] contains a 3-term rainbow arithmetic progression, i.e., an arithmetic progression whose terms are coloured with distin...
full textMy Resources
Save resource for easier access later
Journal title:
bulletin of the iranian mathematical societyPublisher: iranian mathematical society (ims)
ISSN 1017-060X
volume 37
issue No. 3 2012
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023